On the maximal circumradius of a planar convex set containing one lattice point
نویسندگان
چکیده
منابع مشابه
Computing the convex hull of a planar point set
In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...
متن کاملOn the circumradius of acute point sets
A set of points in IR n is said to be in acute position, if the angle determined by any triple of points is at most equal to =2. This paper considers the problem of computing the maximum circumradius of any set of n + 1 points in IR n that is in acute and general position and that has diameter one. It is shown that for n = 3, this maximum circumradius is at most equal to one. For arbitrary n, a...
متن کاملOn the number of disjoint convex quadrilaterals for a planar point set
For a given planar point set P , consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions. 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn the convex layers of a planar set
Let S be a set of n points in the Euclidean plane. The convex layers of S are the convex polygons obtained by iterating on the following procedure: compute the convex hull of S and remove its vertices from S. This process of peeling a planar point set is central in the study of robust estimators in statistics. It also provides valuable information on the morphology of a set of sites and has pro...
متن کاملOn the Rectilinear Convex Layers of a Planar Set
In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n log n) time and O(n) space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1995
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700014519